Sequential Quadratic Optimization for Nonlinear Equality Constrained Stochastic Optimization

نویسندگان

چکیده

Sequential quadratic optimization algorithms are proposed for solving smooth nonlinear problems with equality constraints. The main focus is an algorithm the case when the...

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequential equality-constrained optimization for nonlinear programming

A new method is proposed for solving optimization problems with equality constraints and bounds on the variables. In the spirit of Sequential Quadratic Programming and Sequential Linearly-Constrained Programming, the new method approximately solves, at each iteration, an equality-constrained optimization problem. The bound constraints are handled in outer iterations by means of an Augmented Lag...

متن کامل

On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization Equality Constrained Quadratic Programming Problems Arising in Optimization

We consider the application of the conjugate gradient method to the solution of large equality constrained quadratic programs arising in nonlinear optimization. Our approach is based on a reduced linear system and generates iterates in the null space of the constraints. Instead of computing a basis for this null space, we choose to work directly with the matrix of constraint gradients, computin...

متن کامل

An Inexact Sequential Quadratic Optimization Algorithm for Nonlinear Optimization

We propose a sequential quadratic optimization method for solving nonlinear optimization problems with equality and inequality constraints. The novel feature of the algorithm is that, during each iteration, the primal-dual search direction is allowed to be an inexact solution of a given quadratic optimization subproblem. We present a set of generic, loose conditions that the search direction (i...

متن کامل

Sequential Quadratic Programming forLarge - Scale Nonlinear Optimization ?

The sequential quadratic programming (SQP) algorithm has been one of the most successful general methods for solving nonlinear constrained optimization problems. We provide an introduction to the general method and show its relationship to recent developments in interior-point approaches. We emphasize large-scale aspects.

متن کامل

Equality Constrained Optimization

EQUALITY CONSTRAINED OPTIMIZATION Masao Fukushima Kyoto University Hisashi Mine Kansai University Eiki Yamakawa Kyoto University (Received November 12, 1984: Revised June 12, 1985) This paper is concerned with a differentiable exact penalty function derived by modifying the Wolfe dual of an equality constrained problem. It may be considered that this penalty function belongs to a class of gener...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Siam Journal on Optimization

سال: 2021

ISSN: ['1095-7189', '1052-6234']

DOI: https://doi.org/10.1137/20m1354556